In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...) be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (shrink)

In some recent articles, Cobreros, Egré, Ripley, & van Rooij have defended the idea that abandoning transitivity may lead to a solution to the trouble caused by semantic paradoxes. For that purpose, they develop the Strict-Tolerant approach, which leads them to entertain a nontransitive theory of truth, where the structural rule of Cut is not generally valid. However, that Cut fails in general in the target theory of truth does not mean that there are not certain safe instances of Cut (...) involving semantic notions. In this article we intend to meet the challenge of answering how to regain all the safe instances of Cut, in the language of the theory, making essential use of a unary recovery operator. To fulfill this goal, we will work within the so-called Goodship Project, which suggests that in order to have nontrivial naïve theories it is sufficient to formulate the corresponding self-referential sentences with suitable biconditionals. Nevertheless, a secondary aim of this article is to propose a novel way to carry this project out, showing that the biconditionals in question can be totally classical. In the context of this article, these biconditionals will be essentially used in expressing the self-referential sentences and, thus, as a collateral result of our work we will prove that none of the recoveries expected of the target theory can be nontrivially achieved if self-reference is expressed through identities. (shrink)

In this paper we discuss the extent to which the very existence of substructural logics puts the Tarskian conception of logical systems in jeopardy. In order to do this, we highlight the importance of the presence of different levels of entailment in a given logic, looking not only at inferences between collections of formulae but also at inferences between collections of inferences—and more. We discuss appropriate refinements or modifications of the usual Tarskian identity criterion for logical systems, and propose an (...) alternative of our own. After that, we consider a number of objections to our account and evaluate a substantially different approach to the same problem. (shrink)

When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into Logical Monism. In this paper we show that the arguments usually employed to arrive at this conclusion do not work. The main reason for this is the existence of certain substructural logics which have the same set of valid inferences as Classical Logic—although they are, in a clear (...) sense, non-identical to it. We argue that this phenomenon can be generalized, given the existence of logics which coincide with Classical Logic regarding a number of metainferential levels—although they are, again, clearly different systems. We claim this highlights the need to arrive at a more refined version of the Collapse Argument, which we discuss at the end of the paper. (shrink)

In this paper, we present a non-trivial and expressively complete paraconsistent naïve theory of truth, as a step in the route towards semantic closure. We achieve this goal by expressing self-reference with a weak procedure, that uses equivalences between expressions of the language, as opposed to a strong procedure, that uses identities. Finally, we make some remarks regarding the sense in which the theory of truth discussed has a property closely related to functional completeness, and we present a sound and (...) complete three-sided sequent calculus for this expressively rich theory. (shrink)

In this paper, I start by describing and examining the main results about the option of formalizing the Yablo Paradox in arithmetic. As it is known, although it is natural to assume that there is a right representation of that paradox in first order arithmetic, there are some technical results that give rise to doubts about this possibility. Then, I present some arguments that have challenged that Yablo’s construction is non-circular. Just like that, Priest (1997) has argued that such formalization (...) shows that Yablo’s Paradox involves implicit circularity. In the same direction, Beall (2001) has introduced epistemic factors in this discussion. Even more, Priest has also argued that the introduction of infinitary reasoning would be of little help. Finally, one could reject definitions of circularity in term of fixed-point adopting non-well-founded set theory. Then, one could hold that the Yablo paradox and the Liar paradox share the same non-well-founded structure. So, if the latter is circular, the first is too. In all such cases, I survey Cook’s approach (2006, forthcoming) on those arguments for the charge of circularity. In the end, I present my position and summarize the discussion involved in this volume. En este artículo, describo y examino los principales resultados vinculados a la formalización de la paradoja de Yablo en la aritmética. Aunque es natural suponer que hay una representación correcta de la paradoja en la aritmética de primer orden, hay algunos resultados técnicos que hacen surgir dudas acerca de esta posibilidad. Más aún, presento algunos argumentos que han cuestionado que la construcción de Yablo no sea circular. Así, Priest (1997) ha argumentado que la formalización de la paradoja de Yablo en la aritmética de primer orden muestra que la misma involucra implícitamente circularidad. En la misma dirección, Beall (2001) ha introducido factores epistémicos en esta discusión. Más aún, Priest ha también argumentado que la introducción de razonamiento infinitario como complemento de la formalización en la aritmética sería de poca ayuda. Finalmente, se podría rechazar todo intento de dar definiciones de circularidad en términos de puntos fijos adoptando teoría de conjuntos infundados. Entonces, se podría sostener que la paradoja de Yablo y la del mentiroso comparten la misma estructura infundada. Por eso, si la última es circular, también lo es la primera. En todos los casos, presento el enfoque de Roy Cook (2006, en prensa) sobre estos argumentos que atribuyen circularidad a la construcción de Yablo. En el final, presento mi posición y un breve resumen de la discusión involucrada en este volumen. (shrink)

In this paper, I attempt to throw some light on modal realism. Since it is David Lewis who has put forward the best arguments for thar position, I focus on his work. In the first, I point out that his approach does not provide an adequate account for the intuitive lack of symmetry between the actual and the possible. To begin with, I try to show that the strategy of appealing to both the spatio-temporal network and causality is not at (...) all satisfactory. Secondly, I criticize the argument for modal realism that is based on theoretical benefits. Then, I defend the view that Lewis' indexical analysis of the concept of actuality does not satisfy his own criterion of acceptability: an analysis of actuality should account for the intuitions about our actual word. I claim thet Lewis' objections to other positions can be raised against his own position. Finally, I conclude that, even though Lewis is right in claiming that actualist conceptions do not explain why the possible is not part of the actual, the realist conception fail to account for the special ontological status that we intuitively grant to our own world. (shrink)

El contenido de la presente discusión de Análisis Filosófico surge a partir de diversas actividades organizadas por mí en SADAF y en la UBA. En primer lugar, Roy Cook dictó en SADAF el seminario de investigación intensivo On Yablo's Paradox durante la última semana de julio de 2011. En el seminario, el profesor Cook presentó el manuscrito aún sin finalizar de su libro The Yablo Paradox: An Essay on Circularity, Oxford, Oxford UP, (en prensa). Extensas y apasionantes discusiones ocurrieron durante (...) esos encuentros sobre circularidad y construcciones infinitarias. Fue en ese tiempo, donde me surgió la idea de editar una discusión sobre las ideas que Cook defiende en ese trabajo. El proyecto era una extensión natural del trabajo que veníamos realizando con mi grupo de investigación en temas vinculados al concepto de verdad, autorreferencia y paradojas. Luego, durante el segundo cuatrimestre de 2011, dicté el seminario La paradoja de Yablo, en el instituto de filosofía de la UBA. Algunos de los borradores de los artículos que aparecen en el presente volumen tienen su origen en este curso. Finalmente, invité por segunda vez al profesor Cook al Symposium on Yablo's Paradox realizado en SADAF en julio de 2012. En esta oportunidad, se presentaron las versiones finales de los artículos de Lavinia Picollo, Paula Teijeiro, Federico Pailos, Diego Tajer, Lucas Rosenblatt e Ignacio Ojea que se incluyen a continuación. El encuentro incluyó las inteligentes réplicas del profesor Cook y profundas discusiones sobre los mencionados temas lógicosemánticos. Quiero agradecer a todos los integrantes del Gaf[log] que participaron activamente en las mencionadas actividades, ya sea en la publicación posterior o en los coloquios y seminarios que le dieron origen. Agradezco al Comité editorial de Análisis Filosófico, en especial a Alberto Moretti, quienes apoyaron desde sus comienzos este proyecto. Finalmente, y de manera especial, quiero expresar mi gratitud al profesor Roy Cook, quien no sólo apoyó e inspiró el proyecto desde sus comienzos, sino que además compartió generosamente sus ideas y las discutió con estimulante pasión. (shrink)